Cooperative Cognitive Networks: Optimal, Distributed and Low-Complexity Algorithms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crowdsourcing: Low complexity, Minimax Optimal Algorithms

We consider the problem of accurately estimating the reliability of workers based on noisy labels they provide, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE), an algorithm for estimating the reliability of workers. TE has low complexity, may...

متن کامل

Cooperative Spectrum Sensing Based on a Low-Complexity Cyclostationary Detection Method for Cognitive Radio Networks

Fast reliable spectrum sensing (SS) is a crucial problem in the cognitive radio systems. To address this issue, cyclostationarity-based detection methods, which are generally more complex but more reliable than energy detection methods, have been proposed. This paper presents a new method to detect the presence of the second-order cyclostationarity in the OFDM-based primary user (PU) signals. T...

متن کامل

Low-Complexity Channel Estimation with Set-Membership Algorithms for Cooperative Wireless Sensor Networks

In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channel estimation. Two matrix-based set-membership algorithms are developed for the estimation of the complex matrix channel parameters. The main goal is to reduce the computational complexity significantly as compared with existing channel estimators and extend the lifetime of ...

متن کامل

Optimal Serverless Networks Attacks, Complexity and some Approximate Algorithms

A network attack is a set of network elements that are disabled by an adversary. The goal for the attack is to produce the most possible damage to the network in terms of network connectivity by disabling the least possible number of network elements. We show that the problem of finding the optimal attack in a serverless network is NP-Complete even when only edges or nodes are considered for di...

متن کامل

Optimal Energy-Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks

Inspired by the green communication trend of next-generation wireless networks, we select energy-efficient throughput as optimization metric for jointly optimizing sensing time and working sensors in cooperative cognitive radio networks. Specifically, an iterative algorithm is proposed to obtain the optimal values for these two parameters. Specifically, the proposed iterative algorithm is low c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2013

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2013.2257762